Shorter strings containing all k-element permutations
نویسندگان
چکیده
منابع مشابه
Shorter strings containing all k - element permutations
We consider the problem of finding short strings that contain all permutations of order k over an alphabet of size n, with k ≤ n. We show constructively that k(n− 2) + 3 is an upper bound on the length of shortest such strings, for n ≥ k ≥ 10. Consequently, for n ≥ 10, the shortest strings that contain all permutations of order n have length at most n− 2n+ 3. These two new upper bounds improve ...
متن کاملShort strings containing all k-element permutations
We consider the problem of finding short strings that contain all permutations of order k over an alphabet of size n, with k ≤ n. We show constructively that k(n− 2) + 3 is an upper bound on the length of shortest such strings, for n ≥ k ≥ 10. Consequently, for n ≥ 10, the shortest strings that contain all permutations of order n have length at most n− 2n+ 3. These two new upper bounds improve ...
متن کاملWords containing all permutations of a family of factors
In this note, we prove that if a uniformly recurrent infinite word contains as a factor any finite permutation of words from an infinite family, then either this word is periodic, or its complexity (that is, the number of factors) grows faster than linearly. This result generalizes one of the lemmas of a recent paper by de Luca and Zamboni, where it was proved that such an infinite word cannot ...
متن کاملConnections between Bernoulli Strings and Random Permutations
A sequence of random variables, each taking only two values ”0” or ”1”, is called a Bernoulli sequence. Consider the counts of occurrences of strings of the form {11}, {101}, {1001}, . . . in Bernoulli sequences. Counts of such Bernoulli strings arise in the study of the cycle structure of random permutations, Bayesian nonparametrics, record values etc. The joint distribution of such counts is ...
متن کاملPermutations fixing a k - set
Let k, n be integers with 1 6 k 6 n/2 and select a permutation π ∈ Sn, that is to say a permutation of {1, . . . , n}, at random. What is i(n, k), the probability that π fixes some set of size k? Equivalently, what is the probability that the cycle decomposition of π contains disjoint cycles with lengths summing to k? Somewhat surprisingly, i(n, k) has only recently been at all well understood ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2011
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2011.03.018